The computability path ordering
نویسندگان
چکیده
منابع مشابه
The computability path ordering
This paper aims at carrying out termination proofs for simply typed higherorder calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by lifting a precedence on function symbols. A first version, core CPO, is essentially obtained from the higher-order recursive path ordering (HORPO) by elimina...
متن کاملThe Computability Path Ordering: The End of a Quest
In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments à la Tait and Girard, therefore explaining the name of the improved ...
متن کاملThe Higher-Order Computability Path Ordering: the End of a Quest
This paper provides a new, decidable definition of the higher-order recursive path ordering. Type comparisons are made only when needed, therefore eliminating the need for the computability closure. Bound variables are handled explicitely, making it possible to handle recursors for arbitrary strictly positive inductive types. This new definition appears indeed to capture the essence of computab...
متن کاملThe Light Lexicographic path Ordering
We introduce syntactic restrictions of the lexicographic path ordering to obtain the Light Lexicographic Path Ordering. We show that the light lexicographic path ordering leads to a characterisation of the functions computable in space bounded by a polynomial in the size of the inputs.
متن کاملAn Abstract Path Ordering
Abstract combinatorial commutation properties for separating well-foundedness of unions of relations can be applied to generic path orderings used in termination proofs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2015
ISSN: 1860-5974
DOI: 10.2168/lmcs-11(4:3)2015